Linear codes with few weights from inhomogeneous quadratic functions
نویسندگان
چکیده
Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes with a few weights are constructed from inhomogeneous quadratic functions over the finite field GF(p), where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions of these linear codes are also determined. Index Terms Linear codes, weight distribution, quadratic form, cyclotomic fields, secret sharing schemes.
منابع مشابه
Linear codes with two or three weights from quadratic Bent functions
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field Fp, where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions...
متن کاملLinear Codes With Two or Three Weights From Some Functions With Low Walsh Spectrum in Odd Characteristic
Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights are obtained from some functions with low Walsh spectrum in odd characteristic. Numerical results show that some of the linear codes obtained are optimal or al...
متن کاملA new class of three-weight linear codes from weakly regular plateaued functions
Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do this, we generalize the recent contribution of Mesnager given in [Cryptography and Communications 9(1), 71-84, 2017]. We first present a new class of binary l...
متن کاملA Construction of Linear Codes over $\f_{2^t}$ from Boolean Functions
In this paper, we present a construction of linear codes over F2t from Boolean functions, which is a generalization of Ding’s method [1, Theorem 9]. Based on this construction, we give two classes of linear codes C̃ f and C f (see Theorem 1 and Theorem 6) over F2t from a Boolean function f : Fq → F2, where q = 2n and F2t is some subfield of Fq. The complete weight enumerator of C̃ f can be easily...
متن کاملGeneralized Hamming weights of a class of linear codes
In [22], Kelan Ding and Cunsheng Ding presented a class of linear codes and determined their weight distributions. In this paper, we focus on the generalized Hamming weights of these codes. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting results about subspaces and their dual spaces. On this basis, we solve all the generalized Hamming w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 83 شماره
صفحات -
تاریخ انتشار 2017